Computing Swept Volumes for Sensor Planning Tasks
نویسندگان
چکیده
This paper discusses the computation of the volumes swept by polyhedral objects moving through space and how these volumes can be used for sensor planning in active environments. It presents some new results in the computation of the approximate volumes swept by polyhedral objects as they undergo arbitrary motions. An algorithm is presented which approximates these volumes under a restricted class of motion, along with a discussion of how it can be extended to handle all types of motion. Results computed with this algorithm are also presented. Finally, we discuss methods for guaranteeing that the approximation is within some desired tolerance of the actual surface.
منابع مشابه
Robot Task and Motion Planning with Sets of Convex Polyhedra
Geometric volumes can be used as an intermediate representation for bridging the gap between task planning, with its symbolic preconditions and effects, and motion planning, with its continuous-space geometry. In this work, we use sets of convex polyhedra to represent the boundaries of objects, robot manipulators, and swept volumes of robot motions. We apply efficient algorithms for convex deco...
متن کاملSwept Volumes and Their Use in Viewpoint Computation in Robot Work-Cells
This paper discusses the automaticcomputation of viewpoints for monitoringobjects and features in an active robot work-cell. An important step in our algorithm for finding viewpoints is the computation of the volumes swept by polyhedral objects moving through space. A method for approximating these volumes for arbitrarily moving polyhedra is presented. Some swept volume results are presented, a...
متن کاملKABouM: Knowledge-Level Action and Bounding Geometry Motion Planner
For robots to solve real world tasks, they often require the ability to reason about both symbolic and geometric knowledge. We present a framework, called KABouM, for integrating knowledge-level task planning and motion planning in a bounding geometry. By representing symbolic information at the knowledge level, we can model incomplete information, sensing actions and information gain; by repre...
متن کاملDynamic Sensor Planning
In this paper, we describe a method of extending the sensor planning abilities of the “MVP” Machine Vision Planning system to plan viewpoints for monitoring a preplanned robot task. The dynamic sensor planning system presented here analyzes geometric models of the environment and of the planned motions of the robot, as well as optical models of the vision sensor. Using a combination of swept vo...
متن کاملComputing swept volumes
The swept volume problem is practical, dif®cult and interesting enough to have received a great deal of attention over the years, and the literature contains much discussion of methods for computing swept volumes in many situations. The method presented here permits an arbitrary polyhedral object (given in a typical boundary representation) to be swept through an arbitrary trajectory. A polyhed...
متن کامل